A generic deadlock-free reactive scheduling approach

Generic Methodologies for Deadlock-Free Routing

This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic dependencies among virtual channels. A novel fully adaptive nonminimal deadlock-free routing algorithm has been developed for k-ary n-cube torus network. Since our technique is based on decomposing a network into several su...

Deadlock Avoidance in Train Scheduling: A Model Checking Approach

In this paper we present the deadlock avoidance approach used in the design of the scheduling kernel of an Automatic Train Supervision (ATS) system. The ATS that we have designed prevents the occurrence of deadlocks by performing a set of runtime checks just before allowing a train to move further. For each train, the set of checks to be performed at each step of progress is retrieved from stat...

Designing a Deadlock-Free Train Scheduler: A Model Checking Approach

In this paper we present the approach used in the design of the scheduling kernel of an Automatic Train Supervision system (ATS). A formal model of the railway layout and of the expected service has been used to identify all the possible critical sections of the railway layout in which a deadlock might occur. For each critical section, the prevention of the occurrence of deadlocks is achieved b...

A Composable Deadlock-Free Approach to Object-Based Isolation

A widely used principle in the design of concurrent programs is isolation – the property that a task can operate on shared data without interference from other tasks. In this paper, we introduce a new approach to object-based isolation that is guaranteed to be deadlockfree, while still retaining the rollback benefits of transactions. Further, our approach differentiates between read and write a...

Deadlock-Free Parallel Processing